Improved Inapproximability for TSP
نویسنده
چکیده
The Traveling Salesman Problem is one of the most studied problems in computational complexity and its approximability has been a long standing open question. Currently, the best known inapproximability threshold known is 220 219 due to Papadimitriou and Vempala. Here, using an essentially different construction and also relying on the work of Berman and Karpinski on bounded occurrence CSPs, we give an alternative and simpler inapproximability proof which also improves the bound to
منابع مشابه
Improved Inapproximability Results for the Shortest Superstring and the Bounded Metric TSP
We present a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, Maximum Asymmetric TSP problem, the (1, 2)–ATSP problem, the (1, 2)–TSP problem, the (1, 4)–ATSP problem and the (1, 4)–TSP problem improving on the best up to now known approximation lower bounds for those problems.
متن کاملImproved Inapproximability Results for the Shortest Superstring and Related Problems
We develop a new method for proving explicit approximation lower bounds for the Shortest Superstring problem, the Maximum Compression problem, the Maximum Asymmetric TSP problem, the (1,2)–ATSP problem and the (1,2)–TSP problem improving on the best known approximation lower bounds for those problems.
متن کاملApproximability of TSP on Power Law Graphs
In this paper we study the special case of Graphic TSP where the underlying graph is a power law graph (PLG). We give a refined analysis of some of the current best approximation algorithms and show that an improved approximation ratio can be achieved for certain ranges of the power law exponent β. For the value of power law exponent β = 1.5 we obtain an approximation ratio of 1.34 for Graphic ...
متن کاملOn Approximability of Bounded Degree Instances of Selected Optimization Problems
In order to cope with the approximation hardness of an underlying optimization problem, it is advantageous to consider specific families of instances with properties that can be exploited to obtain efficient approximation algorithms for the restricted version of the problem with improved performance guarantees. In this thesis, we investigate the approximation complexity of selected NP-hard opti...
متن کاملApproximation hardness of graphic TSP on cubic graphs
We prove explicit approximation hardness results for the Graphic TSP on cubic and subcubic graphs as well as the new inapproximability bounds for the corresponding instances of the (1,2)-TSP. The proof technique uses new modular constructions of simulating gadgets for the restricted cubic and subcubic instances. The modular constructions used in the paper could be also of independent interest.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theory of Computing
دوره 10 شماره
صفحات -
تاریخ انتشار 2012